Fast ADMM for Sum-of-Squares Programs Using Partial Orthogonality
نویسندگان
چکیده
منابع مشابه
Simplification Methods for Sum-of-Squares Programs
A sum-of-squares is a polynomial that can be expressed as a sum of squares of other polynomials. Determining if a sum-of-squares decomposition exists for a given polynomial is equivalent to a linear matrix inequality feasibility problem. The computation required to solve the feasibility problem depends on the number of monomials used in the decomposition. The Newton polytope is a method to prun...
متن کاملSum of Squares Programs and Polynomial Inequalities
How can one find real solutions (x1, x2)? How to prove that they do not exist? And if the solution set is nonempty, how to optimize a polynomial function over this set? Until a few years ago, the default answer to these and similar questions would have been that the possi ble nonconvexity of the feasible set and/or objective function precludes any kind of analytic global results. Even today, t...
متن کاملSum of Squares Relaxations for Robust Polynomial Semi-definite Programs
A whole variety of robust analysis and synthesis problems can be formulated as robust Semi-Definite Programs (SDPs), i.e. SDPs with data matrices that are functions of an uncertain parameter which is only known to be contained in some set. We consider uncertainty sets described by general polynomial semi-definite constraints, which allows to represent norm-bounded and structured uncertainties a...
متن کاملMatrix Sum-of-Squares Relaxations for Robust Semi-Definite Programs
Received: date / Revised version: date Abstract. We consider robust semi-definite programs which depend polynomially or rationally on some uncertain parameter that is only known to be contained in a set with a polynomial matrix inequality description. On the basis of matrix sum-of-squares decompositions, we suggest a systematic procedure to construct a family of linear matrix inequality relaxat...
متن کاملOn Orthogonality of Latin Squares
Abstract: A Latin square arrangement is an arrangement of s symbols in s rows and s columns, such that every symbol occurs once in each row and each column. When two Latin squares of same order superimposed on one another, then in the resultant array every ordered pair of symbols occurs exactly once, then the two Latin squares are said to be orthogonal. A frequency square M of type F (n; λ) is ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Automatic Control
سال: 2019
ISSN: 0018-9286,1558-2523,2334-3303
DOI: 10.1109/tac.2018.2886170